When is missing data recoverable?
نویسنده
چکیده
Suppose a non-random portion of a data vector is missing. With some minimal prior knowledge about the data vector, can we recover the missing portion from the available one? In this paper, we consider a linear programming approach to this problem, present numerical evidence suggesting the effectiveness and limitation of this approach, and give deterministic conditions that guarantee a successful recovery. Our theoretical results, though related to recent results in compressive sensing, do not rely on randomization.
منابع مشابه
Graphical Models for Recovering Probabilistic and Causal Queries from Missing Data
We address the problem of deciding whether a causal or probabilistic query is estimable from data corrupted by missing entries, given a model of missingness process. We extend the results of Mohan et al. [2013] by presenting more general conditions for recovering probabilistic queries of the form P (y|x) and P (y, x) as well as causal queries of the form P (y|do(x)). We show that causal queries...
متن کاملOn recovering missing values with minimal error
The paper studies frequency criterions of recoverability of a single missing value from an observed sequence. Stochastic Gaussian stationary processes that are non recoverable in this sense are called minimal processes; they have a degenerate spectral density. The paper considers this problem in a pathwise setting without probabilistic assumptions; recoverability criterions are formulated in th...
متن کاملA New Algorithm to Impute the Missing Values in the Multivariate Case
There are several methods to make inferences about the parameters of the sampling distribution when we encounter the missing values and the censored data. In this paper, through the order statistics and the projection theorem, a novel algorithm is proposed to impute the missing values in the multivariate case. Then, the performance of this method is investigated through the simulation studies. ...
متن کاملAn Iterative Approach to Recovering the Missing Data in a Large Low-rank: Application to SFM
In the field of computer vision, it is common to require operations on matrices with “missing data”, for example because of occlusion or tracking failures. In this paper, we consider a special case, where the large matrix should be of low rank if it is noise free. This constraint often exists, such as in the factorization method for the problem of structure from motion (SFM). In this paper, we ...
متن کاملProbabilistic Linkage of Persian Record with Missing Data
Extended Abstract. When the comprehensive information about a topic is scattered among two or more data sets, using only one of those data sets would lead to information loss available in other data sets. Hence, it is necessary to integrate scattered information to a comprehensive unique data set. On the other hand, sometimes we are interested in recognition of duplications in a data set. The i...
متن کامل